Identification of Bright Lenses from the Astrometric Observations of Gravitational Microlensing Events

When a source star is gravitationally microlensed by a dark lens, the centroid of the source star image is displaced relative to the position of the unlensed source star with an elliptical trajectory. Recently, routine astrometric follow-up measurements of these source star image centroid shifts by using high precision interferometers are proposed to measure the lens proper motion which can resolve the lens parameter degeneracy in the photometrically determined Einstein time scale. When an event is caused by a bright lens, on the other hand, the astrometric shift is affected by the light from the lens, but one cannot identify the existence of the bright lens from the observed trajectory because the resulting trajectory of the bright lens event is also an ellipse. As results, lensing parameters determined from the trajectory differ from those of a dark lens event, causing wrong identification of lens population. In this paper, we show that although the shape and size of the astrometric centroid shift trajectory are changed due to the bright lens, the angular speed of centroid shifts around the apparent position of the unlensed source star is not affected by the lens brightness. Then, one can identify the existence of the bright lens and determine its brightness by comparing the lens parameters determined from the angular speed curve with those determined from the trajectory of observed centroid shifts. Once the lens brightness is determined, one can correct for the lens proper motion. Since the proposed method provides both information about the lens brightness (dark or bright) and the corrected values of the physical parameters of the lens, one can significantly better constrain the nature of MACHOs.Comment: total 5 pages, including 3 Figures and no Table, accepted to MNRA

Brain-Switches for Asynchronous Brain−Computer Interfaces: A Systematic Review

A brain–computer interface (BCI) has been extensively studied to develop a novel communication system for disabled people using their brain activities. An asynchronous BCI system is more realistic and practical than a synchronous BCI system, in that, BCI commands can be generated whenever the user wants. However, the relatively low performance of an asynchronous BCI system is problematic because redundant BCI commands are required to correct false-positive operations. To significantly reduce the number of false-positive operations of an asynchronous BCI system, a two-step approach has been proposed using a brain-switch that first determines whether the user wants to use an asynchronous BCI system before the operation of the asynchronous BCI system. This study presents a systematic review of the state-of-the-art brain-switch techniques and future research directions. To this end, we reviewed brain-switch research articles published from 2000 to 2019 in terms of their (a) neuroimaging modality, (b) paradigm, (c) operation algorithm, and (d) performance

Near Optimal Bounds for Collision in Pollard Rho for Discrete Log

We analyze a fairly standard idealization of Pollard's Rho algorithm for finding the discrete logarithm in a cyclic group G. It is found that, with high probability, a collision occurs in $O(\sqrt{|G|\log |G| \log \log |G|})$ steps, not far from the widely conjectured value of $\Theta(\sqrt{|G|})$. This improves upon a recent result of Miller--Venkatesan which showed an upper bound of $O(\sqrt{|G|}\log^3 |G|)$. Our proof is based on analyzing an appropriate nonreversible, non-lazy random walk on a discrete cycle of (odd) length |G|, and showing that the mixing time of the corresponding walk is $O(\log |G| \log \log |G|)$

Two Approaches to Sidorenko's Conjecture

Sidorenko's conjecture states that for every bipartite graph $H$ on $\{1,\cdots,k\}$, $\int \prod_{(i,j)\in E(H)} h(x_i, y_j) d\mu^{|V(H)|} \ge \left( \int h(x,y) \,d\mu^2 \right)^{|E(H)|}$ holds, where $\mu$ is the Lebesgue measure on $[0,1]$ and $h$ is a bounded, non-negative, symmetric, measurable function on $[0,1]^2$. An equivalent discrete form of the conjecture is that the number of homomorphisms from a bipartite graph $H$ to a graph $G$ is asymptotically at least the expected number of homomorphisms from $H$ to the Erd\H{o}s-R\'{e}nyi random graph with the same expected edge density as $G$. In this paper, we present two approaches to the conjecture. First, we introduce the notion of tree-arrangeability, where a bipartite graph $H$ with bipartition $A \cup B$ is tree-arrangeable if neighborhoods of vertices in $A$ have a certain tree-like structure. We show that Sidorenko's conjecture holds for all tree-arrangeable bipartite graphs. In particular, this implies that Sidorenko's conjecture holds if there are two vertices $a_1, a_2$ in $A$ such that each vertex $a \in A$ satisfies $N(a) \subseteq N(a_1)$ or $N(a) \subseteq N(a_2)$, and also implies a recent result of Conlon, Fox, and Sudakov \cite{CoFoSu}. Second, if $T$ is a tree and $H$ is a bipartite graph satisfying Sidorenko's conjecture, then it is shown that the Cartesian product $T \Box H$ of $T$ and $H$ also satisfies Sidorenko's conjecture. This result implies that, for all $d \ge 2$, the $d$-dimensional grid with arbitrary side lengths satisfies Sidorenko's conjecture.Comment: 20 pages, 2 figure

Probing the Top-Higgs Yukawa CP Structure in dileptonic ttˉht \bar t h with M2M_2-Assisted Reconstruction

Constraining the Higgs boson properties is a cornerstone of the LHC program. We study the potential to directly probe the Higgs-top CP-structure via the $t\bar{t}h$ channel at the LHC with the Higgs boson decaying to a bottom pair and top-quarks in the dileptonic mode. We show that a combination of laboratory and $t\bar{t}$ rest frame observables display large CP-sensitivity, exploring the spin correlations in the top decays. To efficiently reconstruct our final state, we present a method based on simple mass minimization and prove its robustness to shower, hadronization and detector effects. In addition, the mass reconstruction works as an extra relevant handle for background suppression. Based on our results, we demonstrate that the Higgs-top CP-phase $(\alpha)$ can be probed up to $\cos\alpha< 0.7$ at the high luminosity LHC.Comment: 25 pages, 11 figures, 3 table